Brownian Images: A Generic Background Model
نویسندگان
چکیده
The local structure of a suitably differentiable function can be described through it’s truncated Taylor series. Gaussian scale space theory is a sensible framework for calculating image derivatives or the coefficients of the Taylor series up to any order using the corresponding derivatives of the Gaussian kernel. Zero-crossings of invariant combinations of such regularised derivatives have successfully been used as feature detectors. Recent work shows that feature detection can be stated as a simple problem of classification into the feature types of interest (edges, blobs, etc.). The information used in the classification is the mapping of Taylor series coefficients, i.e. image derivatives, into jet space. The conjecture is that features form classes or clusters in jet space. We introduce the classification framework and present feature detection results based on empirical edge and blob models. These models are augmented with a theoretical parametric model of a background feature type, namely the Brownian image model. The background feature type is not to be considered as the class of all non-modelled feature types, but as a new feature type in itself. The quality of the Brownian image background model is further investigated. The background model leads to classification of images into areas which are plausible featureless background areas. From an intuitive point of view the image structure is more complex in areas classified as features as opposed to the simpler background region. We verify this using a reconstruction scheme with spatially uniform constraints and a simple Gaussian assumption of prior pixel distributions. We are, however, also able to show that reconstructions using a Brownian prior results in a significant gain in reconstruction quality for the Brownian like background areas.
منابع مشابه
Data Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach
Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...
متن کاملData Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach
Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...
متن کاملProperties of Brownian Image Models in Scale-Space
In this paper it is argued that the Brownian image model is the least committed, scale invariant, statistical image model which describes the second order statistics of natural images. Various properties of three different types of Gaussian image models (white noise, Brownian and fractional Brownian images) will be discussed in relation to linear scale-space theory, and it will be shown empiric...
متن کاملInvestigation of Brownian Motion of CuO-Water Nanofluid in a Porous Cavity with Internal Heat Generation by Using of LTNE Model
In this paper, the effect of the Brownian term in natural convection of CuO-Water nanofluid inside a partially filled porous cavity, with internal heat generation has been studied. It is assumed that the viscosity and thermal conductivity of nanofluid consists of a static part and a Brownian part of which is a function of temperature and the volume fraction of nanofluid. Because of internal hea...
متن کاملCapturing Outlines of Planar Generic Images by Simultaneous Curve Fitting and Sub-division
In this paper, a new technique has been designed to capture the outline of 2D shapes using cubic B´ezier curves. The proposed technique avoids the traditional method of optimizing the global squared fitting error and emphasizes the local control of data points. A maximum error has been determined to preserve the absolute fitting error less than a criterion and it administers the process of curv...
متن کامل